Large-scale algorithms for minimizing a linear function with a strictly convex quadratic constraint
نویسندگان
چکیده
منابع مشابه
A Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملAn efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...
متن کاملA dual gradient-projection method for large-scale strictly convex quadratic problems
The details of a solver for minimizing a strictly convex quadratic objective function subject to general linear constraints is presented. The method uses a gradient projection algorithm enhanced with subspace acceleration to solve the bound-constrained dual optimization problem. Such gradient projection methods are well-known, but are typically employed to solve the primal problem when only sim...
متن کاملBenchmarking large-scale distributed convex quadratic programming algorithms
This paper aims to collect, benchmark and implement state-of-the-art decomposable convex quadratic programming methods employing duality. In order to decouple the original problem, these methods relax some constraints by introducing dual variables and apply a hierarchical optimization scheme. In the lower level of this scheme, a sequence of parametric quadratic programs is solved in parallel, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MAT Serie A
سال: 2007
ISSN: 1515-4904
DOI: 10.26422/mat.a.2007.14.gib